/**
*      author: Y_Yao
*      created: 2025-04-02 11:13:01
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 9e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 7;
int n,q;
int a[N];
int sum[N];

void solve()
{
    cin >> n >> q;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    for(int i = 1;i <= n;i++)
    {
        sum[i] = sum[i-1] + a[i];
    }
    while(q--)
    {
        int x;
        cin >> x;
        int j = lower_bound(a + 1,a + 1 + n,x) - a;
        int sum1 = sum[j-1];
        int avg1 = x * (j - 1);
        int sum2 = sum[n] - sum[j-1];
        int avg2 = x * (n - j + 1);
        int ans = 0;
        ans += abs(avg1 - sum1);
        ans += abs(avg2 - sum2);
        cout << ans << endl;
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    // cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}